Polarization Optimality of Equally Spaced Points on the Circle for Discrete Potentials

نویسندگان

  • Douglas P. Hardin
  • Amos P. Kendall
  • Edward B. Saff
چکیده

We prove a conjecture of Ambrus, Ball and Erdélyi that equally spaced points maximize the minimum of discrete potentials on the unit circle whenever the potential is of the form n X

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inverse Bernstein Inequalities and Min-max-min Problems on the Unit Circle

We give a short and elementary proof of an inverse Bernsteintype inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle . The inequality is used to show that equally-spaced points solve a min-max-min problem for the logarithmic potential of such polynomials. Using techniques recently developed for polarization (Chebyshev-type) problems, we s...

متن کامل

ابرپتانسیلهای دیگری برای مکانیک کوانتومی ابرتقارنی

  We give a brief review on the known shape invariant potentials. We derive the all of them by introducing a general superpotential with two constant and four variable parameters. Finally we examine those potentials which lead to the equally-spaced energy spectrum for the Klein-Gordon equation.

متن کامل

Ensuring Good Behaviour of the Discrete Hilbert Transform

This paper studies the generation of stable tmnsfer functions for which the real or imaginary part takes prescribed values at discrete uniformly spaced points on the unit circle. Formulas bounding the error between a parIicular interpolating function and any function consistent with the data are presented, which have the desirable property that the error goes to zero exponentially fast with the...

متن کامل

A Multigrid-type Method for Thin Plate Spline Interpolation on a Circle

We consider the problem of thin plate spline interpolation to n equally spaced points on a circle, where the number of data points is suuciently large for work of O(n 3) to be unacceptable. We develop an iterative multigrid-type method, each iteration comprising ngrid stages, and n being an integer multiple of 2 ngrid?1. We let the rst grid, V 1 , be the full set of data points, V say, and each...

متن کامل

A Bose-Einstein Approach to the Random Partitioning of an Integer

Consider N equally-spaced points on a circle of circumference N . Choose at random n points out of N on this circle and append clockwise an arc of integral length k to each such point. The resulting random set is made of a random number of connected components. Questions such as the evaluation of the probability of random covering and parking configurations, number and length of the gaps are ad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2013